Atomic routing in a deterministic queuing model

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A mathematical model for the electric vehicle routing with time windows considering queuing system at charging stations and alternative paths

Due to many damages that human activities have imposed on the environment, authorities, manufacturers, and industry owners have taken into account the development of supply chain more than ever. One of the most influential and essential human activities in the supply chain are transportation which green vehicles such as electric vehicles (EVs) are expected to generate higher economic and enviro...

متن کامل

Probabilistic Routing Using Queuing Theory for Manets

Mobile ad-hoc networks pose real difficulty in finding the multihop shortest paths because of continuous changing positions of the nodes. Traditional ad-hoc routing protocols are proposed to find multi-hop routes based on shortest path routing algorithms, which cannot effectively adapt to time-varying radio links and network topologies of Ad-hoc networks. In this paper we proposed an enhanced r...

متن کامل

PROBABILISTIC ROUTING USING QUEUING THEORY FOR MANETs

Mobile ad-hoc networks pose real difficulty in finding the multihop shortest paths because of continuous changing positions of the nodes. Traditional ad-hoc routing protocols are proposed to find multi-hop routes based on shortest path routing algorithms, which cannot effectively adapt to time-varying radio links and network topologies of Ad-hoc networks. In this paper we proposed an enhanced r...

متن کامل

Atomic Selfish Routing in Networks: A Survey

In this survey we present some recent advances in the literature of atomic (mainly network) congestion games. The algorithmic questions that we are interested in have to do with the existence of pure Nash equilibria, the efficiency of their construction when they exist, as well as the gap of the best/worst (mixed in general) Nash equilibria from the social optima in such games, typically called...

متن کامل

A New Model for Location-Allocation Problem within Queuing Framework

This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research Perspectives

سال: 2014

ISSN: 2214-7160

DOI: 10.1016/j.orp.2014.05.001